OPTIMIZATION OF QUANTUM MONTE CARLO WAVE FUNCTION: STEEPEST DESCENT METHOD
نویسندگان
چکیده
منابع مشابه
Robust wave function optimization procedures in quantum Monte Carlo methods
The energy variance optimization algorithm over a fixed ensemble of configurations in variational Monte Carlo often encounters problems of convergence. Being formally identical to a problem of fitting data, we re-examine it from a statistical maximum-likelihood point of view. We show that the assumption of an underlying Gaussian distribution of the local energy, implicit in the standard varianc...
متن کاملOptimization of quantum Monte Carlo wave functions by energy minimization.
We study three wave function optimization methods based on energy minimization in a variational Monte Carlo framework: the Newton, linear, and perturbative methods. In the Newton method, the parameter variations are calculated from the energy gradient and Hessian, using a reduced variance statistical estimator for the latter. In the linear method, the parameter variations are found by diagonali...
متن کاملA hybrid steepest descent method for constrained convex optimization
This paper describes a hybrid steepest descent method to decrease over time any given convex cost function while keeping the optimization variables into any given convex set. The method takes advantage of properties of hybrid systems to avoid the computation of projections or of a dual optimum. The convergence to a global optimum is analyzed using Lyapunov stability arguments. A discretized imp...
متن کاملThe quantum Monte Carlo method
Quantum Monte Carlo is an important and complementary alternative to density functional theory when performing computational electronic structure calculations in which high accuracy is required. The method has many attractive features for probing the electronic structure of real atoms, molecules and solids. In particular, it is a genuine many-body theory with a natural and explicit description ...
متن کاملA Free Line Search Steepest Descent Method for Solving Unconstrained Optimization Problems
In this paper, we solve unconstrained optimization problem using a free line search steepest descent method. First, we propose a double parameter scaled quasi Newton formula for calculating an approximation of the Hessian matrix. The approximation obtained from this formula is a positive definite matrix that is satisfied in the standard secant relation. We also show that the largest eigen value...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Modern Physics C
سال: 2010
ISSN: 0129-1831,1793-6586
DOI: 10.1142/s0129183110015282